On the maximum empty rectangle problem
نویسندگان
چکیده
منابع مشابه
On the maximum empty rectangle problem
Given a rectangle A and a set S of n points in A, we consider the problem, called the maximum empty rectangle problem, of finding a maximum area rectangle that is fully contained in A and does not contain any point of S in its interior. An O(n’) time algorithm is presented. Furthermore, it is shown that if the points of S are drawn randomly and independently from A, the problem can be solved in...
متن کاملA note on finding a maximum empty rectangle
Given a rectangle A and a set S of n points in A, the maximum empty rectangle problem is that of finding a largest-area rectangle which is contained in A. has its sides parallel to Ihose ofA. and does Dot contain any of the points in S. This Dote describes an efficient algorithm for solving this problem.
متن کاملComputing the Largest Empty Rectangle
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] ...
متن کاملConstrained Empty-Rectangle Delaunay Graphs
Given an arbitrary convex shape C, a set P of points in the plane and a set S of line segments whose endpoints are in P , a constrained generalized Delaunay graph of P with respect to C denoted CDGC(P ) is constructed by adding an edge between two points p and q if and only if there exists a homothet of C with p and q on its boundary and no point of P in the interior visible to both p and q. We...
متن کاملOn the Rectangle Escape Problem
Motivated by a bus routing application, we study the following rectangle escape problem: Given a set S of n rectangles inside a rectangular region R, extend each rectangle in S toward one of the four borders of R so that the maximum density over the region R is minimized, where the density of each point p ∈ R is defined as the number of extended rectangles containing p. We show that the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90124-0